Solving Routing Problem using Particle Swarm Optimization
نویسندگان
چکیده
منابع مشابه
Particle Swarm Optimization In Solving Capacitated Vehicle Routing Problem
The Capacitated Vehicle Routing Problem (CVRP) is a NP – Complete problem and according to this definition there is no exact solution for it. So researchers try to achieve a near optimum solution for it, by using meta – heuristic algorithms. The aim of CVRP is to find optimum route for every vehicle as a sequence of customers, that vehicle served. We employ Particle Swarm Optimization to solve ...
متن کاملSolving Economic Load Dispatch Problem Using Particle Swarm Optimization Technique
Economic load dispatch (ELD) problem is a common task in the operational planning of a power system, which requires to be optimized. This paper presents an effective and reliable particle swarm optimization (PSO) technique for the economic load dispatch problem. The results have been demonstrated for ELD of standard 3-generator and 6-generator systems with and without consideration of transmiss...
متن کاملSolving two-dimensional packing problem using particle swarm optimization
Particle swarm optimization is one of the evolutionary computations which is inspired by social behavior of bird flocking or fish schooling. This research focuses on the application of the particle swarm optimization to two-dimensional packing problem. Packing problem is a class of optimization problems which involve attempting to pack the items together inside a container, as densely as possib...
متن کاملSolving the Economic Dispatch Problem using Novel Particle Swarm Optimization
This paper proposes an improved approach based on conventional particle swarm optimization (PSO) for solving an economic dispatch(ED) problem with considering the generator constraints. The mutation operators of the differential evolution (DE) are used for improving diversity exploration of PSO, which called particle swarm optimization with mutation operators (PSOM). The mutation operators are ...
متن کاملSolving effectively the school timetabling problem using particle swarm optimization
New results are listed below, derived from the algorithm presented at the corresponding paper, due to a minor significance bug correction and further experiments conducted after the publication date of the paper. The new results may differ from those mentioned at the text of the original paper. Nevertheless, the new results are, in the great majority, at least as good as the previous ones conce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/8301-1692